Browsing by Subject "Balanced digraphs"

Now showing items 1-2 of 2

    • Article  

      Distributed weight balancing over digraphs 

      Rikos, A. I.; Charalambous, T.; Hadjicostis, Christoforos N. (2014)
      A weighted digraph is balanced if, for each node, the sum of the weights of the edges outgoing from that node is equal to the sum of the weights of the edges incoming to that node. Weight-balanced digraphs play a key role ...
    • Conference Object  

      Integer weight balancing in directed graphs in the presence of communication delays 

      Rikos, A. I.; Hadjicostis, Christoforos N. (Institute of Electrical and Electronics Engineers Inc., 2015)
      A digraph with positive weights on its edges is weight-balanced if, for each node, the sum of the weights of the incoming edges equals the sum of the weights of the outgoing edges. Weight-balanced digraphs play an important ...